Face recognition using a kernel fractional-step discriminant analysis algorithm

نویسندگان

  • Guang Dai
  • Dit-Yan Yeung
  • Yuntao Qian
چکیده

Feature extraction is among the most important problems in face recognition sys-tems. In this paper, we propose an enhanced kernel discriminant analysis (KDA)algorithm called kernel fractional-step discriminant analysis (KFDA) for nonlinearfeature extraction and dimensionality reduction. Not only can this new algorithm,like other kernel methods, deal with nonlinearity required for many face recognitiontasks, it can also outperform traditional KDA algorithms in resisting the adverse ef-fects due to outlier classes. Moreover, to further strengthen the overall performanceof KDA algorithms for face recognition, we propose two new kernel functions: cosinefractional-power polynomial kernel and non-normal Gaussian RBF kernel. We per-form extensive comparative studies based on the YaleB and FERET face databases.Experimental results show that our KFDA algorithm outperforms traditional ker-nel principal component analysis (KPCA) and KDA algorithms. Moreover, furtherimprovement can be obtained when the two new kernel functions are used.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gabor-Based Kernel Partial-Least-Squares Discrimination Features for Face Recognition

The paper presents a novel method for the extraction of facial features based on the Gabor-wavelet representation of face images and the kernel partial-least-squares discrimination (KPLSD) algorithm. The proposed feature-extraction method, called the Gabor-based kernel partial-least-squares discrimination (GKPLSD), is performed in two consecutive steps. In the first step a set of forty Gabor wa...

متن کامل

Multiresolution Feature Based Fractional Power Polynomial Kernel Fisher Discriminant Model for Face Recognition

This paper presents a technique for face recognition which uses wavelet transform to derive desirable facial features. Three level decompositions are used to form the pyramidal multiresolution features to cope with the variations due to illumination and facial expression changes. The fractional power polynomial kernel maps the input data into an implicit feature space with a nonlinear mapping. ...

متن کامل

Face Recognition by Cognitive Discriminant Features

Face recognition is still an active pattern analysis topic. Faces have already been treated as objects or textures, but human face recognition system takes a different approach in face recognition. People refer to faces by their most discriminant features. People usually describe faces in sentences like ``She's snub-nosed'' or ``he's got long nose'' or ``he's got round eyes'' and so like. These...

متن کامل

Face Recognition Based on Optimal Kernel Minimax Probability Machine

Face recognition has received extensive attention due to its potential applications in many fields. To effectively deal with this problem, a novel face recognition algorithm is proposed by using the optimal kernel minimax probability machine. The key idea of the algorithm is as follows: First, the discriminative facial features are extracted with local fisher discriminant analysis (LFDA). Then,...

متن کامل

Supervised Feature Extraction of Face Images for Improvement of Recognition Accuracy

Dimensionality reduction methods transform or select a low dimensional feature space to efficiently represent the original high dimensional feature space of data. Feature reduction techniques are an important step in many pattern recognition problems in different fields especially in analyzing of high dimensional data. Hyperspectral images are acquired by remote sensors and human face images ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2007